A colour correlation-based stereo matching based on 1D windows
نویسندگان
چکیده
In this paper, we propose an original approach to colour correlation-based stereo matching with mono-dimensional windows. The result of the algorithm is a quasi-dense disparity map associated with its confidence map. For each pixel, correlation indices are computed for several widths of windows and several positions of the current pixel. Three criteria, extracted from each correlation curve, are combined by a fuzzy filter to define a confidence measure. A basic decision rule computes the disparity value and its associated confidence for the most of the image pixels. A first study shows results obtained on grey level images with our 1D method and a classical 2D method. Here, the 1D approach presents better results. Moreover, our method is applied to the RGB colour space. A disparity map is computed with each of the three colour components. A fusion step allows to compute the disparity values based on these three disparity maps. The method is validated on the Tsukuba image pair. In the first time, we show that our method presents lower error rates with the RGB colour space than with the grey level image and this, for identical density rates. In a second time, our results (with the colour way) are compared in terms of errors and density rate with those obtained using similar colour 2D methods (presented on the Middlebury website). Our algorithm is ranked in the first places for each area of the image.
منابع مشابه
Optimizing Disparity Candidates Space in Dense Stereo Matching
In this paper, a new approach for optimizing disparity candidates space is proposed for the solution of dense stereo matching problem. The main objectives of this approachare the reduction of average number of disparity candidates per pixel with low computational cost and high assurance of retaining the correct answer. These can be realized due to the effective use of multiple radial windows, i...
متن کاملCooperative Stereo Matching with Color-Based Adaptive Local Support
Color processing imposes a new constraint on stereo vision algorithms: The assumption of constant color on object surfaces used to align local correlation windows with object boundaries has improved the accuracy of recent window based stereo algorithms significantly. While several algorithms have been presented that work with adaptive correlation windows defined by color similarity, only a few ...
متن کاملColour Contribution for Stereo Image Matching
We examine the contribution of colour for the computation of depth maps from a stereo pair of colour aerial images. As a matter of fact we propose an original method based on fusion theory to compute dense and reliable depth maps. The fusion is directly applied on correlation curves obtained for each colour channel. In order to evaluate the quality of the elevation map, we compare our results t...
متن کاملWindow-based approach for fast stereo correspondence
In this study, the authors present a new area-based stereo matching algorithm that computes dense disparity maps for a real-time vision system. Although many stereo matching algorithms have been proposed in recent years, correlation-based algorithms still have an edge because of speed and less memory requirements. The selection of appropriate shape and size of the matching window is a difficult...
متن کاملPhase-Based Window Matching with Geometric Correction for Multi-View Stereo
Methods of window matching to estimate 3D points are the most serious factors affecting the accuracy, robustness, and computational cost of Multi-View Stereo (MVS) algorithms. Most existing MVS algorithms employ window matching based on Normalized CrossCorrelation (NCC) to estimate the depth of a 3D point. NCC-based window matching estimates the displacement between matching windows with sub-pi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010